Quadratic Gröbner bases for smooth 3 × 3 transportation polytopes
نویسندگان
چکیده
The toric ideals of 3 × 3 transportation polytopes Trc are quadratically generated. The only exception is the Birkhoff polytope B3. If Trc is not a multiple of B3, these ideals even have square-free quadratic initial ideals. This class contains all smooth 3 × 3 transportation polytopes.
منابع مشابه
Toric Ideals of Flow Polytopes
We show that toric ideals of flow polytopes are generated in degree 3. This was conjectured by Diaconis and Eriksson for the special case of the Birkhoff polytope. Our proof uses a hyperplane subdivision method developed by Haase and Paffenholz. It is known that reduced revlex Gröbner bases of the toric ideal of the Birkhoff polytope Bn have at most degree n. We show that this bound is sharp fo...
متن کاملAll Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables
We show that any rational polytope is polynomial-time representable as a “slim” r × c× 3 three-way line-sum transportation polytope. This universality theorem has important consequences for linear and integer programming and for confidential statistical data disclosure. It provides polynomial-time embedding of arbitrary linear programs and integer programs in such slim transportation programs a...
متن کاملApplying Gröbner Bases To“solve” Solvable Polynomials
This paper is designed to introduce the reader to Gröbner bases as well as demonstrate how they may applied in developing algorithms that“solve” solvable polynomials. Specifically, I will use these bases along with some basic invariant theory in order to derive a general formula for the roots of a cubic polynomial with rational coefficients and describe how to compute the exact roots of a quint...
متن کاملA special place of Boolean quadratic polytopes among other combinatorial polytopes
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family P is affinely reduced to a family Q if for every pol...
متن کاملGröbner Bases for Operads
We define a new monoidal category on collections (shuffle composition). Monoids in this category (shuffle operads) turn out to bring a new insight in the theory of symmetric operads. For this category, we develop the machinery of Gröbner bases for operads, and present operadic versions of Bergman’s Diamond Lemma and Buchberger’s algorithm. This machinery can be applied to study symmetric operad...
متن کامل